8dfb99dc8152df0a258f3f88b104888935570659,src/edu/stanford/nlp/trees/UniversalEnglishGrammaticalStructure.java,UniversalEnglishGrammaticalStructure,processNamesHelper,#SemanticGraph#IndexedWord#List#,1863

Before Change


      if (child == newHead) {
        // make the leftmost word the new head
        SemanticGraphEdge oldEdge = sg.getEdge(gov, oldHead);
        sg.addEdge(gov, newHead, oldEdge.getRelation(), oldEdge.getWeight(), oldEdge.isExtra());
        sg.removeEdge(oldEdge);

        // swap direction of relation between old head and new head and change it to name relation.
        oldEdge = sg.getEdge(oldHead, newHead);

After Change


    for (IndexedWord child : children) {
      if (child == newHead) {
        // make the leftmost word the new head
        if (gov == null) {
          sg.getRoots().add(newHead);
          sg.getRoots().remove(oldHead);
        } else {
          SemanticGraphEdge oldEdge = sg.getEdge(gov, oldHead);
          sg.addEdge(gov, newHead, oldEdge.getRelation(), oldEdge.getWeight(), oldEdge.isExtra());
          sg.removeEdge(oldEdge);
        }
        // swap direction of relation between old head and new head and change it to name relation.
        SemanticGraphEdge oldEdge = sg.getEdge(oldHead, newHead);